A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sheela, T.
- Maximization of Throughput by Effective Queue Management Scheme for High Speed Network
Authors
1 Sathyabama University, IN
2 Department of IT, SSN College of Engineering, Chennai, IN
Source
Indian Journal of Science and Technology, Vol 2, No 3 (2009), Pagination: 28-31Abstract
A new algorithm is proposed to control the congestion in the network based on the minimum drop ratio. Explicit Control Protocol (XCP) is adopted for high speed network, where the queue threshold is assigned to be 85% of the queue size. At the time of congestion, whenever the queue size reaches the threshold value, a new buffer is initialized which is half the queue size. This mechanism thus prevents the drop of packets and hence the drop ratio is minimized and throughput is maximized. Performance of bandwidth utilization, throughput and drop ratio is presented.Keywords
Network, XCP, Drop Ratio, Throughput, QueueFull Text
References
- David X (2006) BIC TCP: motivation, architecture, algorithms, performanc. IEEE/ACM Trans. Networking. 14 (6), 1246-1259
- Fernando Paganini, Steven H. Low (2005) Congestion Control for high performance, stability and fairness in General Networks. IEEE/ACM Trans. Networking. 13 (1), 43-56.
- Huajun Liu (2005) Research of the queue management algorithms application to the network processor. J. Commu. Computer. 2 (5), 112-117.
- Kyle Halliday, Andrew Hurst and Jerom Nelson (2004) Analysis of next generation TCP. Lawrence Livermore Natl. Lab. 12-13.
- Li-song Shao, He-ying Zhang and Wen-hua Dou (2006) General Window based Congestion Control: Buffer occupancy, network efficiency, packet loss. Proc. 4th Ann. Commu. Networks Services Res. Conf.(CNSR’06). 2, 195-201.
- Mehdi Farokhian Firuzi and Mohammad Haeri (2005) Active queue management in TCP networks bared on self tuning control approach. Proc. 2005 IEEE Conf. Control Algorithms. 3, 904-909.
- Nishan R.Sastry and Simon S.Lam (2005) CYRF: A theory of window based unicast congestion control. IEEE/ACM Trans. Networking. 13, 330-342.
- Peng Wang and David L. Mills (2006) Simple analysis of XCP equilibrium performance. Proc. 40th IEEE Ann. Conf. 2, 585-590.
- Ramesh Johari and David Kim Hong Tang (2001) End-toend congestion control for internet: delays and stability. IEEE/ACM Trans. Networking. 9 (6), 818-832.
- Sally Floyd and Kevin Fall (1998) Promoting the use of endto- end congestion control in internet. IEEE/ACM Trans. Networking. 7 (4), 1-15.
- Sanjeeva Athuraliya and Steven H.Low (2001) REM: active queue management. J. IEEE Network. 15, 48-53.
- Satyanarayan Reddy K and Lokanatha C. Reddy (2008) A survey on congestion control mechanisms in high speed networks. IJCSNS Intl. J. Computer Sci. Network Security. 8 (1),, 208-212.
- Satyanarayan Reddy K and Lokanatha C. Reddy (2008) A survey on congestion control protocols for high speed network. IJCSNS Intl. J. Computer Sci. Network Security. 8 (7), 44-52.
- Sherali Zeadally and Liqiang Zhan (2004) Enabling gigabit network Access to end users. IEEE Proc. IEEE. 92 (2), 340-353.
- Steven H. Low (2003) A duality model of TCP and queue management algorithms. IEEE/ACM Trans. Networking. 11 (4), 520-546.
- Steven L. Low, Achlan L.H. Andrew (2005) Understanding XCP: equilibrium and fairness. Proc. IEEE Infocom. 2, 1-12.
- Yongguang and Lang (2005) An implementation and experimental study of the explicit control protocol (XCP). Proc. IEEE 24th Ann. Joint Conf. of the Computer & Commu. Soc. 2, 1037-1048.
- A New Model for Cong Estion Detection in High Speed Network with High Speed Protocols Creating
Authors
Source
National Journal of System and Information Technology, Vol 2, No 2 (2009), Pagination: 158-168Abstract
Continuously growing needs for Internet applications that transmit massive amount of data has led to the emergence of high speed networks. The primary factor hindering the flow of Traffic is Network Congestion. Data transfer must take place without any congestion. The Internet carries certain critical data and information which need to be delivered to the receiver at all cost. Thus Congestion Detection plays a key role in high speed networks. The Traditional TCP has been used over the years to detect and control Congestion. Various algorithms such as ECN, DECbit, RED Queue Mechanism are adopted by TCP to detect Congestion. In this paper, a rational mechanism utilizing XCP protocol is used. Adopting the techniques of a new congestion detection module with effective feedback mechanism and modified window adjustment is achieved. A Separate Congestion Detection Module is developed to detect and inform immediate Congestion Detection and Control. The feedback parameters are calculated based on arrival rate, service rate, traffic rate and queue size. Resulting in no drastic decrease in window size, better increase in sending rate because of which there is a continuous flow of data without congestion. Therefore as a result of this, there is a maximum increase in throughput, high utilization of the bandwidth and minimum delay. The result of the proposed work is presented as a graph based on throughput, delay and window size. Thus in this paper, XCP protocol is well illustrated and the various parameters for Congestion Detection are thoroughly analyzed and adequately presented.Keywords
TCP/IP, Congestion Detection, Window Management, Feedback Control, Queue Management, Explicit Control Protocol
References
- Sherali Zeadally and Liqiang Zhang (2004)Enabling giga bit network Access to end Users” IEEE proc., Vol. 92 No. 2,pp:340-353
- Peng Wang and David .L .Mills,(2006) “Simple analysis of XCP equilibrium performance”, Proc. 40th IEEE Ann.Conf, pp:585-590, IEEE’06
- Li-song, shao ,He-ying , Zhang, Wenhua,Dou,(2006) ”General Window Based Congestion Control Buffer Occupancy, Network Efficiency and Packet loss” proc of 4th Ann Comm.Networks, pp:195-201, IEEE’06
- Steven.L.Low,achlan.L.H.Andrew Bartek (2005) “Understanding XCP: Equilibrium and fairness”, Proc of IEEE Infocom, pp: 1-12.
- Fernando Paganini, Steven.H.Low(2005) “Congestion Control for High Performance Stability and Fairness in General Networks” IEEE/ ACM NETWORKING, vol.13 .No.1, pp:43-56
- Nishan R.Sastry and Simon.S.Lam(2005) “CYRF:A theory of window based unicast congestion control”, IEEE/ACM TRANSACTIONS ON NETWORKING, vol. 13, pp:330-342 .
- Yongguang and Lang(2005) “An implementation and experimental study of the explicit control protocol (XCP)”, IEEE 24th Ann. Joint Conf of the computer & communication. Soc-2, pp: 1037-1048.
- Sanjeeva Athuraliya and Steven.H.Low, (2001)“REM:Active Queue Management” IEEE Network, pp: 48-53.
- Ramesh Johari and David Kim Hong Tang(2001) “End-to-End Congestion Control for Internet: Delays and stability”, IEEE/ACM TRANSACTIONS ON NETWORKING,vol.9 No. 6, pp: 818-831.
- Sally Floyd and Kevin Fall,(1998) “Promoting the use of end-to-end congestion control in internet” , IEEE/ACM TRANSACTIONS ON NETWORKING, vol. 7,no. 4, pp:1-15
- David X, (2006)“BIC TCP: Motivation, Architecture, Algorithms, Performance”, IEEE/ACM TRANSACTIONSONS ON NETWORKING,VOL. 14, NO. 6.
- Kyle Halliday, Andrew Hurst and Jerom Nelson,(2004) ”Analysis of next Generation TCP”, pp:12-12.
- Yee-Ting Li,Douglas Leith and Robert Shorten,(2004)” Experimental Evaluation of TCP protocols for High-Speed Networks.
- Damon Wischik(2006) , ”Buffer Requirements for High Speed Routers”.
- Khaled M.Elleithy and Ali S.Al-Suwaiyan, (2001)”Network Traffic Characterization for High –Speed Networks Supporting Multimedia.”, pp:200-202, IEEE’01.
- Satyanarayan Reddy K and Lokanatha C Reddy (2008)“A Survey on Congestion Control Mechanism in High Speed Networks”, IJCSNS, International Journal of Computer Science Network Security, vol. 8, no.1, pp:208-212.
- Satyanarayan Reddy K and Lokanatha C Reddy (2008)“A Survey on Congestion Control Protocols for High Speed Networks”, IJCSNS, International Journal of Computer Science Network Security, vol. 8, no.7, pp:44-52.
- Steven H.Low (2005) “A duality Model of TCP Queue Management Algorithms”, IEEE/ACM Transactions on Networking, vol.11, no.4, pp:520-546,
- Huajun Liu(2005) “Research of the Queue Management Algorithms Journal of Communication and Computers, vol 2, No 5, pp:16-19
- Jiakun Liu (2003)“Threshold Crossing Analysis of High Speed Network Traffic”, pp:915-918, IEEE,’03
- C.Jin.D.X.Wei & S.H.Low(2004), “FAST TCP, R. Agrawal and R. Srikanth, Fast algorithms for mining association rules, in: Proc. VLDB, Santiago, Chile, September 1994.
- D.J.Leith & R.N.Shorten,(2004) “H-TCP Protocol for Highspeed Long Distance Networks”, in 2nd Workshop on Protocols for fast Long Distance Networks, USA.
- L.Xu, K.Harfoush, I.Rhee(2004), “Binary Increase Congestion Control (BIC) for Fast Long Distance Networks”, In IEEE Infocom,
- C.Jin.D.Wei & S.H.Low,(2006) “Fast TCP Motivation,Architecture,Algorithms, Performance”,IEEE/ACM Transactions on Networking, Vol.14. no. 6,pp:1246-1259.
- Yee.Ting, Li, douglas Leith & Robert.N,92007) “Experimental Evaluation of TCP Protocols for High Speed Networks”, IEEE/ACMTransaction Networking, pp:1109- 1122.
- Optimization of Location Verification Algorithm in Wireless Sensor Network
Authors
1 Dhanalakshmi Srinivasan Engineering College, Perambalur, IN
2 Dept. of ECE, Dhanalakshmi Srinivasan Engineering College, Perambalur, IN
Source
Artificial Intelligent Systems and Machine Learning, Vol 6, No 4 (2014), Pagination: 135-138Abstract
In wireless sensor network localization schemes are used to knowing the location of all sensor nodes. But some localization is subjected to many malicious attacks in the network such as wormhole attack. Therefore, sensors locations are not truthful and need to be verified the sensors' locations are trustable or not. To detect the abnormal location in wireless sensor networks, this paper propose technique called in-region verification and Distributed In-Region Verification. Each region has separate verification center in distributed verification algorithm, and one verification center for in-region verification. Use of multiple verification centers in the network is reducing communication overhead and high detection accuracy. Performance of previous location verification algorithms are analyzed through graph. Better performance finds the suitable location verification algorithm for wireless sensor network.
Keywords
Wireless Sensor Network, Localization, In-Region, Location Verification.- Slicing+: An Efficient Privacy Preserving Data Publishing
Authors
1 Department of Computer Science and Engineering, Sathyabama University, Chennai - 600119, Tamil Nadu, IN
2 Department of Information Technology, Sri Sairam Engineering College, Chennai - 600044, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 21 (2016), Pagination:Abstract
Objectives: Privacy and accuracy are always trade off factors in the field of data publishing. Ideally both the factors are considered critical for data handling. Privacy loss and accuracy loss need to be maintained low as possible for an efficient data handling system. Authors have come up with various data publishing techniques aiming to achieve balance between these 2 factors. Generalization, Bucketization and Slicing are well known techniques among the list. Unfortunately they have their own limitation in handling privacy and accuracy. Generalization suffers in handling high dimensional data thus experiencing higher utility loss. Bucketization lacks data privacy where parting sensitive and quasi identifier attributes is a challenge. Slicing on the other hand though offers better privacy and accuracy, there is always scope to improve data correlation aiming in reducing utility loss. This paper explains a new technique called Slicing+ which handles privacy and accuracy factors effectively. This new slicing+ technique looks promising as it offers flexibility for data publisher to decide on how the data need to published. Data publisher can tune the Slicing+ technique to get data published with better privacy than accuracy or the other way. Algorithms for the two cases are derived and realized usingORANGE tool. This paper explains analysis done for the first bucket tuples. As an improvement aspect, similar analysis can be done for other buckets and all the bucket tuples merged and reconstructed for complete analysis. This analysis is applied in the medical records. This hybrid slicing technique is rated against Privacy loss and Utility gain factors. Experimental results are analyzed to justify the performance of Slicing+ technique.
Keywords
Accuracy, Data Mining, Privacy, Publishing, Slicing.Full Text